A Convergence Analysis for Nonsymmetric Lanczos Algorithms
نویسنده
چکیده
A convergence analysis for the nonsymmetric Lanczos algorithm is presented. By using a tridiagonal structure of the algorithm, some identities concerning Ritz values and Ritz vectors are established and used to derive approximation bounds. In particular, the analysis implies the classical results for the symmetric Lanczos algorithm.
منابع مشابه
Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem
This paper presents an error analysis of the Lanczos algorithm in finite-precision arithmetic for solving the standard nonsymmetric eigenvalue problem, if no breakdown occurs. An analog of Paige's theory on the relationship between the loss of orthogonality among the Lanczos vectors and the convergence of Ritz values in the symmetric Lanczos algorithm is discussed. The theory developed illustra...
متن کاملThe BiCOR and CORS Iterative Algorithms for Solving Nonsymmetric Linear Systems
We present two iterative algorithms for solving real nonsymmetric and complex nonHermitian linear systems of equations and that were developed from variants of the nonsymmetric Lanczos method. In this paper, we give the theoretical background of the two iterative methods and discuss their main computational aspects. Using a large number of numerical experiments, we analyze their convergence pro...
متن کاملA Breakdown-free Variation of the Nonsymmetric Lanczos Algorithms
The nonsymmetric Lanczos tridiagonalization algorithm is essentially the Gram-Schmidt biorthogonalization method for generating biorthogonal bases of a pair of Krylov subspaces. It suffers from breakdown and instability when a pivot at some step is zero or nearly zero, which is often the result of mismatch of the two Krylov subspaces. In this paper, we propose to modify one of the two Krylov su...
متن کاملRestarting the Nonsymmetric Lanczos Algorithm
A restarted nonsymmetric Lanczos algorithm is given for computing eigenvalus and both right and left eigenvectors. The restarting limits the storage so that finding eigenvectors is practical. Restarting also makes it possible to deal with roundoff error in new ways. We give a scheme for avoiding near-breakdown and discuss maintaining biorthogonality. A system of linear equations can be solved s...
متن کاملRestarting the Nonsymmetric Lanczos Algorithm for Eigenvalues and Linear Equations Including Multiple Right-Hand Sides
A restarted nonsymmetric Lanczos algorithm is given for computing eigenvalues and both right and left eigenvectors. The restarting limits the storage so that finding eigenvectors is practical. Restarting also makes it possible to deal with roundoff error in new ways. We give a scheme for avoiding near-breakdown and discuss maintaining biorthogonality. A system of linear equations can be solved ...
متن کامل